Construction of resilient functions over a finite alphabet
نویسندگان
چکیده
We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet. This leads to a generalization of some related cryptographic objects as perfect local randomizers. It also enables us to construct new resilient functions by composition of resilient functions of smaller order.
منابع مشابه
Construction of t-Resilient Functions over a Finite Alphabet
Wr rxttnd the notions of correlation-immune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Slinsori as wc givc an orthogonal array characterizat,ion and a Fourier transform characterization for resilient functions over any finite alphabet. This leads to a generalization ...
متن کاملCorrelation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography
We extend the notions of correlation-immune functions and resilient functions to functions over any finite alphabet. A previous result due to Gopalakrishnan and Stinson is generalized as we give an orthogonal array characterization, a Fourier transform and a matrix characterization for correlation-immune and resilient functions over any finite alphabet endowed with the structure of an Abelian g...
متن کاملAuthentication codes based on resilient Boolean maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps wh...
متن کاملCoinductive Properties of Lipschitz Functions on Streams
A simple hierarchical structure is imposed on the set of Lipschitz functions on streams (i.e. sequences over a fixed alphabet set) under the standard metric. We prove that sets of non-expanding and contractive functions are closed under a certain coiterative construction. The closure property is used to construct new final stream coalgebras over finite alphabets. For an example, we show that th...
متن کاملConstruction of an Elliptic Curve over Binary Finite Fields to combine with LDPC Code in Mobile Communication
In this paper we propose the construction of an efficient cryptographic system, based on the combination of the ElGamal Elliptic Curve Algorithm and Low Density Parity Check (LDPC) codes for mobile communication. When using elliptic curves and codes for cryptography it is necessary to construct elliptic curves with a given or known number of points over a given finite field, in order to represe...
متن کامل